M. S. Paterson
ABSTRACT
Information is not transferred instantaneously; there is always a propagation delay before an output is available as an input to the next computational step. Propagation delay is a function of wire length, so we study the length of edges in planar graphs. We prove matching (to within a constant factor) upper and lower bounds on minimax edge length for four planar embedding problems for complete binary trees. (The results are summarized in Table 1.) Because trees are often subcircuits of larger circuits, these results imply general performance limits due to propagation delay. The results give important information for the popular technique of pipelining.
- 1.Bentley, J.L. and Kung, H.T., A Tree Machine for Searching Problems, Proceedings of the International Conference on Parallel Processing (1979), 257-266.Google Scholar
- 2.Brent, R.P. and Kung, H.T., On the Area of Binary Tree Layouts, Carnegie-Mellon University, 1979.Google Scholar
- 3.Brent, R.P. and Kung, H.T., A Regular Layout for Parallel Adders, Technical Report CMU-CS-79-131, Carnegie-Mellon University, 1979.Google Scholar
- 4.Gannon, D.B., On Pipelining a Mesh Connected Multiprocessor for Finite Element Problems by Nested Disection, Proceedings of the Internatiuonal Conference on Parallel Processing (1980), 197-204.Google Scholar
- 5.Ladner, R.E. and Fischer, M.J., Parallel Prefix Computation, 1977 International Conference on Parallel Processing (1977). Also available as Technical Report 77-02-02, University of Washington, Department of Computer Science.Google Scholar
- 6.Mead, C.A. and Conway, L.C., "Introduction to VLSI Systems", Addison-Wesley Publishing Co., Reading, Massachusetts, 1980. Google ScholarDigital Library
- 7.Rosenberg, A.L. and Snyder, L., Bounds on the Cost of Data Encodings, Mathematical Systems Theory 12 (1978), 9-39.Google ScholarCross Ref
- 8.Stone, H.S., Parallel Processing with the Perfect Shuffle, IEEE Transactions on Computers C-20 (1971), 153-161.Google ScholarDigital Library
- 9.Thompson, C.D., Private CommunicationGoogle Scholar
- 10.Valiant, L.G., Universality Considerations in VLSI Circuits, Edinburgh University, December, 1979.Google Scholar
Index Terms
- Bounds on minimax edge length for complete binary trees
Recommendations
Edge-disjoint rainbow spanning trees in complete graphs
Let G be an edge-colored copy of K n , where each color appears on at most n / 2 edges (the edge-coloring is not necessarily proper). A rainbow spanning tree is a spanning tree of G where each edge has a different color. Brualdi and Hollingsworth (1996) ...
Expansion of layouts of complete binary trees into grids
Let Th be the complete binary tree of height h. Let M be the infinite grid graph with vertex set Z2, where two vertices (x1, y1) and (x2, y2) of M are adjacent if and only if |x1-x2| + |y1-y2|= 1. Suppose that T is a tree which is a subdivision of Th and ...
Tight Upper and Lower Bounds on the Path Length of Binary Trees
The external path length of a tree $T$ is the sum of the lengths of the paths from the root to each external node. The maximal path length difference , $\Delta$, is the difference between the lengths of the longest and shortest such paths.
Tight ...
Comments